A Family of 2-weight Codes Related to Bch-codes
نویسنده
چکیده
For every prime-power q and every pair of natural numbers m n 0 we construct a q-ary linear code of length q m (q n 0 ? 1)(q n 0 ? q n 0 ?m + 1)=(q?1) and dimension 3n 0 ; whose only nonzero weights are q 2n 0 +m?1 ? q 2n 0 ?1 and q 2n 0 +m?1 ? q 2n 0 ?1 + q n 0 +m?1 : These code parameters and those of the corresponding family of strongly regular graphs are new in odd characteristic.
منابع مشابه
The dimension and minimum distance of two classes of primitive BCH codes
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, ...
متن کاملThe coset weight distributions of certain BCH codes and a family of curves
Many problems in coding theory are related to the problem of determining the distribution of the number of rational points in a family of algebraic curves defined over a finite field. Usually, these problems are very hard and a complete answer is often out of reach. In the present paper we consider the problem of the weight distributions of the cosets of certain BCH codes. This problem turns ou...
متن کاملStudying the locator polynomials of minimum weight codewords of BCH codes
We consider only primitive binary cyclic codes of length n = 2 m ? 1. A BCH-code with designed distance is denoted B(n;). A BCH-code is always a narrow-sense BCH-code. A codeword is identiied with its locator polynomial, whose coeecients are the symmetric functions of the locators. The deenition of the code by its zeros-set involves some properties for the power sums of the locators. Moreover t...
متن کاملCyclic and BCH codes whose minimum distance equals their maximum BCH bound
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the form xn − 1. We apply our results to the study of those BCH codes C, with designed distance δ, that have minimum distance d(C) = δ. Finally, we pres...
متن کاملNarrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$
Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (qm−1)/(q−1). Little is known about ...
متن کاملA Method to determine Partial Weight Enumerator for Linear Block Codes
In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical perfo...
متن کامل